A critical-path based iterated local search for the green permutation flowshop problem

The permutation flowshop scheduling problem is a widely studied combinatorial optimization with several real-world applications. In this paper we address green variant of the controllable processing times and two objective functions: one related to service level factory (makespan) another total cost or energy/carbon consumption. For propose novel Critical-Path based Iterated Local Search. This metaheuristic incorporates theoretical results accelerate search solutions in intensification phase. proposed algorithm has been compared on an extensive benchmark most promising algorithms literature. computational show excellent performance proposal.